N ov 2 00 5 Spin networks , quantum automata and link invariants
نویسندگان
چکیده
The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with purely discrete unitary gates, the simulator is naturally modelled as families of quantum automata which in turn represent discrete versions of topological quantum computation models. Such a quantum combinatorial scheme, which essentially encodes SU(2) Racah–Wigner algebra and its braided counterpart, is particularly suitable to address problems in topology and group theory and we discuss here a finite states– quantum automaton able to accept the language of braid group in view of applications to the problem of estimating link polynomials in Chern–Simons field theory.
منابع مشابه
Spin networks, quantum automata and link invariants
The spin network simulator model represents a bridge between (generalized) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFT). More precisely, when working with purely discrete unitary gates, the simulator is naturally modelled as families of quantum automata which in turn represent discrete versions of topological qua...
متن کاملar X iv : h ep - t h / 05 11 10 5 v 1 9 N ov 2 00 5 QCD partition function in the external field in the covariant gauge
The QCD partition function in the external stationary gluomag-netic field is computed in the third order in external field invariants in arbitrary dimension and arbitrary covariant gauge. The contributions proportional to third order invariants in gluon field strength are shown to be dependent on covariant quantum gauge fixing parameter α.
متن کاملQuantum Computation of Universal Link Invariants
In the framework of the spin-network simulator based on the SUq(2) tensor algebra, we implement families of finite state quantum automata capable of accepting the language generated by the braid group, and whose transition amplitudes are coloured Jones polynomials. The automaton calculation of the polynomial of a link L on n strands at any fixed root of unity q is bounded from above by a linear...
متن کاملA Link Prediction Method Based on Learning Automata in Social Networks
Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...
متن کاملN ov 2 00 7 Representations of quivers , their generalizations and invariants
This paper is a survey on invariants of representations of quivers and their generalizations. We present the description of generating systems for invariants and relations between generators.
متن کامل